Fast systematic encoding of multiplicity codes
نویسنده
چکیده
We present quasi-linear time systematic encoding algorithms for multiplicity codes. The algorithms have their origins in the fast multivariate interpolation and evaluation algorithms of van der Hoeven and Schost (2013), which we generalise to address certain Hermite-type interpolation and evaluation problems. By providing fast encoding algorithms for multiplicity codes, we remove an obstruction on the road to the practical application of the private information retrieval protocol of Augot, Levy-dit-Vehel and Shikfa (2014).
منابع مشابه
Fast Encoding of Algebraic Geometry Codes ∗
SUMMARY We propose an encoding method for one-point algebraic geometry codes that usually requires less computation than the ordinary systematic encoder.
متن کاملFast Encoding of Polar Codes With Reed-Solomon Kernel
A low-complexity systematic encoding algorithm for polar codes with Reed-Solomon kernel is presented. The proposed method relies on fast Fourier transform based ReedSolomon encoding techniques. Application of polar codes in storage systems is considered.
متن کاملFast Erasure-and-Error Decoding and Systematic Encoding of a Class of Affine Variety Codes
In this paper, a lemma in algebraic coding theory is established, which is frequently appeared in the encoding and decoding for algebraic codes such as Reed–Solomon codes and algebraic geometry codes. This lemma states that two vector spaces, one corresponds to information symbols and the other is indexed by the support of Gröbner basis, are canonically isomorphic, and moreover, the isomorphism...
متن کاملPerformance Analysis and Improvement of LT Codes over AWGN Channels
LT codes, the first universal erasure-correcting codes, have near-optimal performance over binary erasure channels for any erasure probability, but exhibit high bit error rate and error floor over the noisy channels. This paper investigated the performance of LT codes over the additive white Gaussian noise channels. We designed the systematic LT codes through reconstructing the bipartite graph ...
متن کاملPermutation decoding of Z 2 Z 4 - linear codes
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codes such as Z2Z4-linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1704.07083 شماره
صفحات -
تاریخ انتشار 2017